Immersing branched surfaces in dimension three
نویسندگان
چکیده
منابع مشابه
Immersing almost geodesic surfaces in a closed hyperbolic three manifold
Let M be a closed hyperbolic three manifold. We construct closed surfaces that map by immersions into M so that for each, one the corresponding mapping on the universal covering spaces is an embedding, or, in other words, the corresponding induced mapping on fundamental groups is an injection.
متن کاملPersistently laminar branched surfaces
We define sink marks for branched complexes and find conditions for them to determine a branched surface structure. These will be used to construct branched surfaces in knot and tangle complements. We will extend Delman’s theorem and prove that a non 2-bridge Montesinos knot K has a persistently laminar branched surface unless it is equivalent to K(1/2q1, 1/q2, 1/q3, −1) for some positive integ...
متن کاملR-covered Branched Surfaces
We give sufficient conditions for an R-covered codimension one foliation F of a closed 3-manifold to be carried by an Rcovered branched surface; that is, a branched surface carrying only foliations with the R-covered property. These conditions can be readily verified for many examples. In cases where the branched surface is generated by disks, the R-covered property is stable for F in the sense...
متن کاملLaminar Branched Surfaces in 3–manifolds
We define a laminar branched surface to be a branched surface satisfying the following conditions: (1) Its horizontal boundary is incompressible; (2) there is no monogon; (3) there is no Reeb component; (4) there is no sink disk (after eliminating trivial bubbles in the branched surface). The first three conditions are standard in the theory of branched surfaces, and a sink disk is a disk branc...
متن کاملImmersing Small Complete Graphs
Following in the spirit of the Hadwiger and Hajós conjectures, AbuKhzam and Langston have conjectured that every k-chromatic graph contains an immersion of Kk. They proved this for k ≤ 4. Here we make the stronger conjecture that every simple graph of minimum degree k−1 contains an immersion ofKk. We prove that this conjecture holds for every k ≤ 7.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1992
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1992-1098398-2